0 62 1 - 19 90
نویسنده
چکیده
A Bounded Disorder file [9] [11] is a mechanism for maintaining files in traditional. systems. It guarantees good performance for single-key operations (e.g. search, insert, and delete), similar to that of hash based methods, and in addition, good performance for subrange operations, and reasonable performance for sequential-key operations (Le. subrange operations for which the output must be produced in key order). To obtain these capabilities, some main memory space is required. In this paper, we consider the problem of maintaining Bounded Disorder files in multiprocessor multi-disk systems which consist of P processor-disk pairs. The processors are either tightly coupled (communicate via shared memory) or loosely coupled (communicate via a local network). The straightforward solution is to equally partition the file records among processors, each of which maintains its part as a "local" Bounded Disorder file (stored in the processor's main memory and disk). This method is highly parallel (up to P single-key operations can be executed in parallel) and achieves good performance due to the use of Bounded Disorder files. We present an alternative method, called Conceptual Bounded Disorder file, whose major advantage is its very low consumption of main memory space. More specifically, depending on implementation details, the saving in main memory space (in comparison with the Bounded Disor der files used in the straightforward solution) may range from 41* K~Pt,. *100% to 41*100%, where P is the number of processors, K in the key size, and ptr is the size of a pointer that points to a disk page. This significant cut down in main memory space consumption has no negative ef fect on performance and parallel execution capabilities; sometimes performance is even improved. •Address: Gabriel Matsliach, Technion Dept. of Computer Science, Haifa 32000, ISRAEL. Telephone: (972) 4-294308. E-mail: Bitnet: [email protected] Csnet: [email protected] tThis research was supported by the E. &: J. Bishop Fund at the Technion. -
منابع مشابه
Sentinel-lymph-node procedure in colon and rectal cancer: a systematic review and meta-analysis.
BACKGROUND No consensus exists on the validity of the sentinel-lymph-node procedure for assessment of nodal status in patients with colorectal cancer. We aimed to assess the diagnostic performance of this procedure. METHODS We searched Embase and PubMed databases for studies published before March 20, 2010. Eligible studies had a prospective design, a sample size of at least 20 patients, and ...
متن کاملManagement of potential laboratory exposure to avian influenza (H5N1) virus: implications for pandemic planning.
Medicine Postgraduate year 1 (n = 21) 12 (57) 4 (19) 19 (90) Postgraduate year 2 (n = 1 9 ) 11 (58) 15 (79) 19 (100) Postgraduate year 3 (« = 12) 8 (67) 7 (58) 12 (100) Physician assistant (« = 4) 1 (25) 2 (50) 3 (75) Nonmedicine Postgraduate year 1 (n = 5) 0 (0) 1 (20) 4 (80) Postgraduate year 2 (n = 4) 2 (50) 2 (50) 3 (75) Postgraduate year 3 (n = 3) 1 (33) 2 (67) 2 (67) Physician assistant (...
متن کاملPatient-controlled analgesia for labour using remifentanil: a feasibility study.
We have investigated the efficacy and safety of remifentanil in a patient-controlled analgesia device for labour in 21 women. Remifentanil was available in increasing doses (bolus doses 0.25-1.0 microg x kg(-1)) with and without a background infusion (0.025-0.05 microg x kg(-1) x min(-1)). A lockout time of 2 min was used. Thirteen out of 21 (62%) women chose to continue using remifentanil up t...
متن کاملar X iv : 0 90 3 . 05 62 v 1 [ as tr o - ph . G A ] 3 M ar 2 00 9 Introduction to Millimeter / Sub - Millimeter
متن کامل
Hilbert’s theorem 90 and generalizations
These notes are based on the Number Theory seminar I gave at Purdue University on September 19, 2013 titled “Hilbert’s theorem 90 and generalization”. The proof of Hilbert’s 90 is taken from an answer I found on MathOverflow at http://mathoverflow.net/a/21117. In the seminar, Professor Goins asked an interesting question about the isomorphism classes of rank one tori which I have blogged here. ...
متن کاملCatalan Traffic at the Beach
The ubiquitous Catalan numbers Cn = (2n n ) / (n + 1) occur as t (n,−n) in the following table showing the number of ways to reach the point (n,m) on a rectangular grid under certain traffic restrictions, indicated by arrows. m 1↑→ 3↑→ 6↑→ 9↑→ 12↑→ 12↑→ 12↓→ ↘ 2 1↑→ 2↑→ 3↑→ 3↑→ 3↓→ ↘ 12↓→↘ 1 1↑→ 1↑→ 1↓→ ↘ 3↓→↘ 3↓→↘ 12↓→↘ start here 1↑→gate ↘ 1↓→↘ 1↓→↘ 3↓→↘ 6↓→↘ 15↓→↘ −1 ≈ 1 →↘ 1↓→↘ 2↓→↘ 4↓→↘ 9↓...
متن کامل